Preconditioning of elliptic problems by approximation in the transform domain
نویسندگان
چکیده
منابع مشابه
TR-CS-97-12 Preconditioning of elliptic problems by approximation in the transform domain
A list of technical reports, including some abstracts and copies of some full reports may be found at: A fast vectorised implementation of Wallace's normal random number generator. April 1997. Abstract Preconditioned conjugate gradient method is applied for solving linear systems Ax = b where the matrix A is the discretization matrix of second-order elliptic operators. In this paper, we conside...
متن کاملDomain decomposition preconditioning for elliptic problems with jumps in coefficients
In this paper, we propose an effective iterative preconditioning method to solve elliptic problems with jumps in coefficients. The algorithm is based on the additive Schwarz method (ASM). First, we consider a domain decomposition method without ‘cross points’ on interfaces between subdomains and the second is the ‘cross points’ case. In both cases the main computational cost is an implementatio...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Parallel domain decomposition preconditioning for the adaptive finite element solution of elliptic problems in three dimensions
A novel weakly overlapping two level additive Schwarz domain decomposition preconditioning algorithm is presented which is appropriate for the parallel nite element solution of elliptic partial di erential equations in three dimensions. This algorithm allows each processor to be assigned one or more subdomains and, as with most parallel domain decomposition solvers, each processor is able to so...
متن کاملEquivalent operator preconditioning for linear elliptic problems
Finite element or finite difference approximations to linear partial differential equations of elliptic type lead to algebraic systems, normally of very large size. However, since the matrices are sparse, even extremely large-sized systems can be handled. To save computer memory and elapsed time, such equations are normally solved by iteration, most commonly using a preconditioned conjugate gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 1997
ISSN: 0006-3835,1572-9125
DOI: 10.1007/bf02510358